翻訳と辞書 |
Postage stamp problem : ウィキペディア英語版 | Postage stamp problem The postage stamp problem is a mathematical riddle that asks what is the smallest postage value which cannot be placed on an envelope, if the latter can hold only a limited number of stamps, and these may only have certain specified face values.〔Jeffrey Shallit (2001), (''The computational complexity of the local postage stamp problem'' ). SIGACT News 33 (1) (March 2002), 90-94. Accessed on 2009-12-30.〕 For example, suppose the envelope can hold only three stamps, and the available stamp values are 1 cent, 2 cents, 5 cents, and 20 cents. Then the solution is 13 cents; since any smaller value can be obtained with at most three stamps (e.g. 4 = 2 + 2, 8 = 5 + 2 + 1, etc.), but to get 13 cents one must use at least four stamps. ==Mathematical definition== Mathematically, the problem can be formulated as follows: : Given an integer ''m'' and a set ''V'' of positive integers, find the smallest integer ''z'' that cannot be written as the sum ''v''1 + ''v''2 + ··· + ''v''''k'' of some number ''k'' ≤ ''m'' of (not necessarily distinct) elements of ''V''.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Postage stamp problem」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|